Encoding hybridized institutions into first-order logic
نویسندگان
چکیده
منابع مشابه
Encoding hybridized institutions into first-order logic
A ‘hybridisation’ of a logic, referred to as the base logic, consists of developing the characteristic features of hybrid logic on top of the respective base logic, both at the level of syntax (i.e. modalities, nominals, etc.) and of the semantics (i.e. possible worlds). By ‘hybridised institutions’ we mean the result of this process when logics are treated abstractly as institutions (in the se...
متن کاملEncoding TLA+ set theory into many-sorted first-order logic
We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art smt solvers. This translation is the main component of a back-end prover based on smt solvers in the TLA Proof System.
متن کاملEncoding TLA ^+ + into Many-Sorted First-Order Logic
This paper presents an encoding of a non-temporal fragment of the TLA language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term re...
متن کاملTranslating First-Order Theories into Logic Programs
This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theor...
متن کامل1 Embedding of First-Order Nominal Logic into Higher-Order Logic
Nominal logic, also referred to as hybrid logic, is a general term for extensions of ordinary modal logics that introduce a new sort of atomic formulae, the socalled nominals. These nominals are only true at one possible world and false at every other world. The shifter, denoted @, can be used to evaluate the truth of a formula φ at a given world corresponding to nominal i as in @iφ. The simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2014
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129514000383